Long runs under a conditional limit distribution
نویسندگان
چکیده
منابع مشابه
Long runs under a conditional limit distribution
HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau...
متن کاملConditional limit theorems under Markov conditioning
Ahtract -Let Xi, X, , . be independent identically distributed random variables taking values in a finite set X and consider the conditional joint distribution of the first m elements of the sample Xt; . ., X, on the condition that A’, = x, and the sliding block sample average of a function h( ., .) defined on X2 exceeds a threshold OL > Eh( Xt, X2). For m fixed and M + co, this conditional joi...
متن کاملWhen Short Runs Beat Long Runs
What will yield the best results: doing one run n generations long or doing m runs n/m generations long each? This paper presents a techniqueindependent analysis which answers this question, and has direct applicability to scheduling and restart theory in evolutionary computation and other stochastic methods. The paper then applies this technique to three problem domains in genetic programming....
متن کاملPDE8A runs interference to limit PKA inhibition of Raf-1.
Myriad extracellular and intracellular signals constantly poke or prod cells in order to influence the vast number of functions required of cells to maintain homeostasis. Selective reception of these signals and of their subsequent translation and transduction are tasks coordinated by cellular signaltransduction systems. Two of these systems, the Ras/Raf/MEK (mitogen-activated ERKkinase)/ERK ca...
متن کاملBinary Gray Codes with Long Bit Runs
We show that there exists an n-bit cyclic binary Gray code all of whose bit runs have length at least n − 3 log2 n. That is, there exists a cyclic ordering of {0, 1}n such that adjacent words differ in exactly one (coordinate) bit, and such that no bit changes its value twice in any subsequence of n − 3 log2 n consecutive words. Such Gray codes are ‘locally distance preserving’ in that Hamming ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Applied Probability
سال: 2014
ISSN: 1050-5164
DOI: 10.1214/13-aap975